class Solution {
public:
    vector<int> intersection(vector<int>& nums1, vector<int>& nums2) 
    {
        sort(nums1.begin(), nums1.end());
        sort(nums2.begin(), nums2.end());

        vector<int> res;

        int i = 0, j = 0;

        while(i < nums1.size() && j < nums2.size())
        {

            if(nums1[i] == nums2[j])
            {
                res.push_back(nums1[i]);
                i++;
                j++;
            }

            else if(nums1[i] < nums2[j])
            {
                i++;
            }

            else 
                j++;

        }

        set<int> set(res.begin(), res.end());
        res.assign(set.begin(), set.end());
        
        return res;
               
    }
};